Fast Intersections for Subdivision Surfaces
نویسندگان
چکیده
Subdivision surface intersections can be costly to compute. They require the intersection of high resolution meshes in order to obtain accurate results, which can lead to slow performance and high memory usage. In this paper we show how the strong convex hull property can lead to a method for efficiently computing intersections at high resolutions. Consequently, the method can be used with any subdivision scheme that has the strong convex hull property. In this method, a bipartite graph structure is used to track potentially intersecting faces.
منابع مشابه
Algebraic pruning: a fast technique for curve and surface intersection
Computing the intersection of parametric and algebraic curves and surfaces is a fun damental problem in computer graphics and geometric modeling This problem has been extensively studied in the literature and di erent techniques based on subdivision interval analysis and algebraic formulation are known For low degree curves and surfaces algebraic methods are considered to be the fastest whereas...
متن کاملArbitrary 3D Resolution Discrete Ray Tracing of Implicit Surfaces
A new approach to ray tracing implicit surfaces based on recursive space subdivision is presented in this paper. Interval arithmetic, already used to calculate intersections in ray tracing and ray casting (numerically or subdividing 1D or 2D spaces), is now used here to implement a ray tracing based on reliable rays traversals into a potentially infinite octree-like subdivided space, eliminatin...
متن کاملMeshToSS: Converting Subdivision Surfaces from Dense Meshes
The theoretical aspects are discussed of our developed software, MeshToSS, for the conversion to Loop subdivision surfaces of dense triangular meshes. This software generates subdivision surfaces that approximate to their original mesh. The output is either a control mesh or its subdivided mesh applied to the Loop subdivision scheme. Our simple approach for the conversion is based on a well-kno...
متن کاملREVERSE LOOP SUBDIVISION FOR GEOMETRY AND TEXTURES
Reverse subdivision aims at constructing a coarser representation of an object given by a fine polygon mesh. In this paper, we first derive a mask for reverse Loop subdivision that can be applied to both regular and extraordinary vertices. The mask is parameterized, and thus can also be used in reversing variants of Loop subdivision, such as those proposed by Warren and Litke. We apply this mas...
متن کاملReverse Engineering Using a Subdivision Surface Scheme
Subdivision surfaces are finding their way into many Computer Aided Design and Animation packages. Popular choices include Loop, Catmull-Clark, Doo-Sabin etc. Subdivision surfaces have many design advantages over traditional use of NURBs. NURB surfaces always are problematic when multiple patches meet. Reverse engineering (RE) is associated with the idea of scanning physical objects and represe...
متن کامل